Nominal Logic Programming

Nominal logic is an extension of first-order logic which provides a simple foundation for formalizing and reasoning about abstract syntax modulo consistent renaming of bound names (that is, alpha-equivalence). This article investigates logic programming based on nominal logic. We describe some typical nominal logic programs, and develop the model-theoretic, proof-theoretic, and operational semantics of such programs. Besides being of interest for ensuring the correct behavior of implementations, these results provide a rigorous foundation for techniques for analysis and reasoning about nominal logic programs, as we illustrate via examples.Comment: 46 pages; 19 page appendix; 13 figures. Revised journal submission as of July 23, 200

A Lambda Term Representation Inspired by Linear Ordered Logic

We introduce a new nameless representation of lambda terms inspired by ordered logic. At a lambda abstraction, number and relative position of all occurrences of the bound variable are stored, and application carries the additional information where to cut the variable context into function and argument part. This way, complete information about free variable occurrence is available at each subterm without requiring a traversal, and environments can be kept exact such that they only assign values to variables that actually occur in the associated term. Our approach avoids space leaks in interpreters that build function closures. In this article, we prove correctness of the new representation and present an experimental evaluation of its performance in a proof checker for the Edinburgh Logical Framework. Keywords: representation of binders, explicit substitutions, ordered contexts, space leaks, Logical Framework.Comment: In Proceedings LFMTP 2011, arXiv:1110.668

Environmental dependence of X-ray and optical properties of galaxy clusters

Galaxy clusters are widely used to constrain cosmological parameters through their properties, such as masses, luminosity, and temperature distributions. One should take into account all kind of biases that could affect these analyses in order to obtain reliable constraints. In this work, we study the difference in the properties of clusters residing in different large-scale environments, defined by their position within or outside of voids, and the density of their surrounding space. We use both observational and simulation cluster and void catalogues, i.e. XMM Cluster Survey (XCS) and redMaPPer clusters, Baryon Oscillation Spectroscopic Survey (BOSS) voids, and Magneticum simulations. We devise two different environmental proxies for the clusters and study their redshift, richness, mass, X-ray luminosity, and temperature distributions, as well as some properties of their galaxy populations. We use the Kolmogorov–Smirnov two-sample test to discover that richer and more massive clusters are more prevalent in overdense regions and outside of voids. We also find that clusters of matched richness and mass in overdense regions and outside voids tend to have higher X-ray luminosities and temperatures. These differences could have important implications for precision cosmology with clusters of galaxies, since cluster mass calibrations can vary with environment

The Jubilee ISW Project - II. Observed and simulated imprints of voids and superclusters on the cosmic microwave background

We examine the integrated Sachs–Wolfe (ISW) imprint of voids and superclusters on the cosmic microwave background. We first study results from the Jubilee N-body simulation. From Jubilee, we obtain the full-sky ISW signal from structures out to redshift z = 1.4 and a mock luminous red galaxy catalogue. We confirm that the expected signal in the concordance cold dark matter (CDM) model is very small and likely to always be much smaller than the anisotropies arising at the last scattering surface. Any current detections of such an imprint must, therefore, predominantly arise from something other than an ISW effect in a CDM universe. Using the simulation as a guide, we then look for the signal using a catalogue of voids and superclusters from the Sloan Digital Sky Survey. We find a result that is consistent with the CDM model, i.e. a signal consistent with zero

A proposal for broad spectrum proof certificates

International audienceRecent developments in the theory of focused proof systems provide flexible means for structuring proofs within the sequent calculus. This structuring is organized around the construction of ''macro'' level inference rules based on the ''micro'' inference rules which introduce single logical connectives. After presenting focused proof systems for first-order classical logics (one with and one without fixed points and equality) we illustrate several examples of proof certificates formats that are derived naturally from the structure of such focused proof systems. In principle, a proof certificate contains two parts: the first part describes how macro rules are defined in terms of micro rules and the second part describes a particular proof object using the macro rules. The first part, which is based on the vocabulary of focused proof systems, describes a collection of macro rules that can be used to directly present the structure of proof evidence captured by a particular class of computational logic systems. While such proof certificates can capture a wide variety of proof structures, a proof checker can remain simple since it must only understand the micro-rules and the discipline of focusing. Since proofs and proof certificates are often likely to be large, there must be some flexibility in allowing proof certificates to elide subproofs: as a result, proof checkers will necessarily be required to perform (bounded) proof search in order to reconstruct missing subproofs. Thus, proof checkers will need to do unification and restricted backtracking search

A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems

Basic proof-search tactics in logic and type theory can be seen as the root-first applications of rules in an appropriate sequent calculus, preferably without the redundancies generated by permutation of rules. This paper addresses the issues of defining such sequent calculi for Pure Type Systems (PTS, which were originally presented in natural deduction style) and then organizing their rules for effective proof-search. We introduce the idea of Pure Type Sequent Calculus with meta-variables (PTSCalpha), by enriching the syntax of a permutation-free sequent calculus for propositional logic due to Herbelin, which is strongly related to natural deduction and already well adapted to proof-search. The operational semantics is adapted from Herbelin's and is defined by a system of local rewrite rules as in cut-elimination, using explicit substitutions. We prove confluence for this system. Restricting our attention to PTSC, a type system for the ground terms of this system, we obtain the Subject Reduction property and show that each PTSC is logically equivalent to its corresponding PTS, and the former is strongly normalising iff the latter is. We show how to make the logical rules of PTSC into a syntax-directed system PS for proof-search, by incorporating the conversion rules as in syntax-directed presentations of the PTS rules for type-checking. Finally, we consider how to use the explicitly scoped meta-variables of PTSCalpha to represent partial proof-terms, and use them to analyse interactive proof construction. This sets up a framework PE in which we are able to study proof-search strategies, type inhabitant enumeration and (higher-order) unification

Self-similarity and universality of void density profiles in simulation and SDSS data

The stacked density profile of cosmic voids in the galaxy distribution provides an important tool for the use of voids for precision cosmology. We study the density profiles of voids identified using the ZOBOV watershed transform algorithm in realistic mock luminous red galaxy (LRG) catalogues from the Jubilee simulation, as well as in void catalogues constructed from the SDSS LRG and Main Galaxy samples. We compare different methods for reconstructing density profiles scaled by the void radius and show that the most commonly used method based on counts in shells and simple averaging is statistically flawed as it underestimates the density in void interiors. We provide two alternative methods that do not suffer from this effect; one based on Voronoi tessellations is also easily able to account from artefacts due to finite survey boundaries and so is more suitable when comparing simulation data to observation. Using this method, we show that the most robust voids in simulation are exactly self-similar, meaning that their average rescaled profile does not depend on the void size. Within the range of our simulation, we also find no redshift dependence of the mean profile. Comparison of the profiles obtained from simulated and real voids shows an excellent match. The mean profiles of real voids also show a universal behaviour over a wide range of galaxy luminosities, number densities and redshifts. This points to a fundamental property of the voids found by the watershed algorithm, which can be exploited in future studies of voids

An Improved Implementation and Abstract Interface for Hybrid

Hybrid is a formal theory implemented in Isabelle/HOL that provides an interface for representing and reasoning about object languages using higher-order abstract syntax (HOAS). This interface is built around an HOAS variable-binding operator that is constructed definitionally from a de Bruijn index representation. In this paper we make a variety of improvements to Hybrid, culminating in an abstract interface that on one hand makes Hybrid a more mathematically satisfactory theory, and on the other hand has important practical benefits. We start with a modification of Hybrid's type of terms that better hides its implementation in terms of de Bruijn indices, by excluding at the type level terms with dangling indices. We present an improved set of definitions, and a series of new lemmas that provide a complete characterization of Hybrid's primitives in terms of properties stated at the HOAS level. Benefits of this new package include a new proof of adequacy and improvements to reasoning about object logics. Such proofs are carried out at the higher level with no involvement of the lower level de Bruijn syntax.Comment: In Proceedings LFMTP 2011, arXiv:1110.668